An Incremental Method for Generating Prime Implicants/Impicates
نویسندگان
چکیده
Given the recent investigation of Clause Management Systems (CMSs) for Artificial Intelligence applications, there is an urgent need for art efficient incremental method for generating prime implicants. Given a set of clauses 5 c, a set of prime implicants 1I of ~ and a clause C, the problem can be formulated as finding the set of prime implicaate for II t.J {C). Intuitively, the property of implicants being prime implies that any effort to generate prime implicants from a set of prime implica~ts will not yield any new prime implicants but themselves. In this paper, we exploit the properties of prime implicaats and propose an inerementM method for generating prime implicants from a set of existing prime implieants plus a new clause. The correctness proof and complexity analysis of the incremental method are presented, and the intricacy of subsumptions in the incremental method is also examined. Additionally, the role of prime implicants in the CMS is also mentioned.
منابع مشابه
A Method for Generating all the Prime Implicants of Binary CNF Formulas
In this paper, we propose a method for generating all the prime implicants of a binary CNF formula. The main idea consists in using an algorithm for generating the maximal independent sets to compute all the primes implicants that cover a model. Such an approach mainly allows to reduce the number of calls to a SAT oracle. Before describing this algorithm, we propose a preprocessing method for r...
متن کاملComputation of Prime Implicants Using Matrix and Paths
In this paper, an efficient algorithm to compute the set of prime implicants of a prepositional formula in Conjunc-tive Normal Form (CNF) is presented. The proposed algorithm uses a concept of representing the formula as a bi-nary matrix and computing paths through the matrix as implicants. The algorithm finds the prime implicants as theprime paths using the divide-and-conquer techn...
متن کاملPrime Implicates and Prime Implicants in Modal Logic: Extended and Revised Version
The purpose of this paper is to examine how the propositional notions of prime implicates and prime implicants might be appropriately extended to the modal logic K. We begin the paper by considering a number of potential definitions of clauses and terms for K. The different definitions are evaluated with respect to a set of syntactic, semantic, and complexity-theoretic properties characteristic...
متن کاملFault Tree Analysis: 10 Prime Implicants and Beyond
The performances of almost all available fault tree analysis tools are limited by the performance of the prime implicant computation procedure they use. All these procedures manipulate the prime implicants of the fault trees explicitly, so that their complexities are directly related to the number of prime implicants to be generated. This paper presents a new analysis method of coherent as well...
متن کاملMINI: A Heuristic Approach for Logic Minimization
MINI is a heuristic logic minimization technique for many-variable problems. It accepts as input a Boolean logic specification expressed as an input-output table, thus avoiding a long list of minterms. It seeks a minimal implicant solution, without generating all prime implicants, which can be converted to prime implicants if desired. New and effective subprocesses, such as expanding, reshaping...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Symb. Comput.
دوره 9 شماره
صفحات -
تاریخ انتشار 1990